Verifying pCTL Model Checking
نویسندگان
چکیده
Probabilistic model checkers like PRISM check the satisfiability of probabilistic CTL (pCTL) formulas against discrete-time Markov chains. We prove soundness and completeness of their underlying algorithm in Isabelle/HOL. We define Markov chains given by a transition matrix and formalize the corresponding probability measure on sets of paths. The formalization of pCTL formulas includes unbounded cumulated rewards.
منابع مشابه
PCTL model checking of symbolic probabilistic systems ∗
Probabilistic model checking is a method for automatically verifying that a probabilistic system satisfies a property with a given likelihood, with the probabilistic temporal logic Pctl being a common choice for the property specification language. In this paper, we explore methods for model checking Pctl properties of infinite-state systems in which probabilistic and nondeterministic behaviour...
متن کاملModel Checking for a Probabilistic Branching
We consider concurrent probabilistic systems, based on probabilistic automata of Segala & Lynch 55], which allow non-deterministic choice between probability distributions. These systems can be decomposed into a collection of \computation trees" which arise by resolving the non-deterministic, but not probabilistic, choices. The presence of non-determinism means that certain liveness properties ...
متن کاملVerifying Randomized Distributed Algorithms with PRISM?
In this paper we describe our experience with model checking randomized distributed algorithms using PRISM, a symbolic model checker for concurrent probabilistic systems currently being developed. PRISM uses Multi-Terminal Binary Decision Diagrams (MTBDDs) as supplied by the CUDD package of Fabio Somenzi. Implemented in Java, PRISM has a system description language similar to Reactive Modules a...
متن کاملTo Be Certain about Uncertainties: Probabilistic Model Checking with Uncertainties
We address the problem of verifying PCTL properties of Markov Decision Processes whose state transition probabilities are only known to lie within uncertainty sets. Using results from convex theory and duality, we propose a suite of verication algorithms and prove their soundness, completeness and termination when arbitrary convex models of uncertainty are considered. Furthermore, soundness and...
متن کاملA Simple Probabilistic Extension of Modal Mu-calculus
Probabilistic systems are an important theme in AI domain. As the specification language, PCTL is the most frequently used logic for reasoning about probabilistic properties. In this paper, we present a natural and succinct probabilistic extension of μ-calculus, another prominent logic in the concurrency theory. We study the relationship with PCTL. Surprisingly, the expressiveness is highly ort...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012